%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi@80/2008/07.17.22.39
%2 sid.inpe.br/sibgrapi@80/2008/07.17.22.39.48
%@doi 10.1109/SIBGRAPI.2008.7
%T Approximations by Smooth Transitions in Binary Space Partitions
%D 2008
%A Lage, Marcos,
%A Bordignon, Alex,
%A Petronetto, Fabiano,
%A Veiga, Alvaro,
%A Tavares, Geovan,
%A Lewiner, Thomas,
%A Lopes, Hélio,
%@affiliation Department of Mathematics, PUC–Rio de Janeiro, Brazil
%@affiliation Department of Mathematics, PUC–Rio de Janeiro, Brazil
%@affiliation Department of Mathematics, PUC–Rio de Janeiro, Brazil
%@affiliation Department of Electrical Engineering, PUC–Rio de Janeiro, Brazil
%@affiliation Department of Mathematics, PUC–Rio de Janeiro, Brazil
%@affiliation Department of Mathematics, PUC–Rio de Janeiro, Brazil
%@affiliation Department of Mathematics, PUC–Rio de Janeiro, Brazil
%E Jung, Cláudio Rosito,
%E Walter, Marcelo,
%B Brazilian Symposium on Computer Graphics and Image Processing, 21 (SIBGRAPI)
%C Campo Grande, MS, Brazil
%8 12-15 Oct. 2008
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K Binary Space Partitions, Smooth Transition Regression Trees, Classification and Regression Tree.
%X This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Space Partitions Trees with the statistical robustness of Smooth Transition Regression Trees. The construction of the tree is straightforward and easily controllable, using error-driven metrics or external constraints. Moreover, it leads to a concise representation. Applications on synthetic and real data, both scalar and vector-valued demonstrated the effectiveness of this approach.
%@language en
%3 lewiner-bsp.pdf